A continuous exact set

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Continuous Exact Set1

A linearly ordered set 21 is called exact2 if it is not similar to any of its proper subsets. It is easily seen that 21 is exact if and only if the only similarity transformation of 21 into itself is the identity [9, p. 341]. The first example of an exact set was given by Dushnik and Miller in [5]; for related investigations, such as the decomposition of a set into exact subsets, see the biblio...

متن کامل

Exact Sampling from a Continuous State Space

Propp & Wilson (1996) described a protocol, called coupling from the past, for exact sampling from a target distribution using a coupled Markov chain Monte Carlo algorithm. In this paper we extend coupling from the past to various MCMC samplers on a continuous state space; rather than following the monotone sampling device of Propp & Wilson, our approach uses methods related to gamma-coupling a...

متن کامل

Sudoku into Exact Hitting Set

I Exploratory data analysis I Presenting results in concise, meaningful graphs and tables I Basics of inferenzial statistics I Organization of Experiments (Experimental Design) I Sequential statistical testing: a methdology for tuning The goal of dealing with Experimental Algorithmics is not only producing a more correct analysis but adding an important tool to the development of a good, functi...

متن کامل

The continuous knapsack set

We study the convex hull of the continuous knapsack set which consists of a single inequality constraint with n non-negative integer andm non-negative bounded continuous variables. When n = 1, this set is a slight generalization of the single arc flow set studied by Magnanti, Mirchandani, and Vachani (1993). We first show that in any facet-defining inequality, the number of distinct non-zero co...

متن کامل

Leveraging Set Relations in Exact Set Similarity Join

Exact set similarity join, which finds all the similar set pairs from two collections of sets, is a fundamental problem with a wide range of applications. The existing solutions for set similarity join follow a filtering-verification framework, which generates a list of candidate pairs through scanning indexes in the filtering phase, and reports those similar pairs in the verification phase. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1958

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1958-0095131-8